Access control in mobile ambient calculi: A comparative view
نویسندگان
چکیده
منابع مشابه
Electoral Systems in Ambient Calculi
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calculus of Mobile Ambients (MA). Zimmer has shown that the synchronous pi-calculus without choice can be encoded in pure (no communication) Safe Ambients. We show that pure MA without restriction has symmetric electoral sys...
متن کاملA Hacking View of Access Control
The importance of computer security in order to maintain the confidentiality, integrity and availability of data and information is well known. Different mechanisms have been proposed in order to guarantee the security of information like access control, encipherment, data integrity and authentication; however, those security mechanisms have vulnerabilities that are exploited. This paper presen...
متن کاملAmbient Calculi with Types: A Tutorial
A tutorial introduction to the key concepts of ambient calculi and their type disciplines, illustrated through a number of systems proposed in the last few years, such as Mobile Ambients, Safe Ambients, Boxed Ambients, and other related calculi with types.
متن کاملMobile Access to the Services in Ambient Networks
Ambient Networks will enable mobile terminals to communicate in an environments populated by several networks, devices, services and artefacts in a transparent way to the final user. In these scenarios, one way of implementing services uses web service architecture. So it is important to study how these mobile devices will integrate efficiently to access web services. Because of the reduced cap...
متن کاملSymmetric electoral systems for ambient calculi
This paper compares the expressiveness of different fragments of ambient calculi via leader election problems. We consider Mobile Ambients (MA), Safe Ambients (SA) and the Push and Pull Ambient Calculus (PAC). Cardelli and Gordon encoded the asynchronous pi-calculus into MA. Zimmer has shown that the synchronous pi-calculus without choice can be encoded in pure (no communication) SA. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.024